Dialectics of Knowledge Representation in a Granular Rough Set Theory
نویسنده
چکیده
The concepts of rough and definite objects are relatively more determinate than those of granules and granulation in general rough set theory (RST) [1]. Representation of rough objects can however depend on the dialectical relation between granulation and definiteness. In this research, we exactify this aspect in RST over proto-transitive approximation spaces. This approach can be directly extended to many other types of RST. These are used for formulating an extended concept of knowledge interpretation (KI)(relative the situation for classical RST) and the problem of knowledge representation (KR) is solved. These will be of direct interest in granular KR in RST as developed by the present author [2] and of rough objects in general. In [3], these have already been used for five different semantics by the present author. This is an extended version of [4] with key examples and more results. keywords: Rough Objects, Proto Transitivity, Granulation, RYS, Lattice Theory of Definite Objects, Axiomatic Theory of Granules, Contamination Problem, Granular Knowledge, Knowledge Representation.
منابع مشابه
Dialectics of Counting and Measures of Rough Theories
New concepts of rough natural number systems, recently introduced by the present author, are used to improve most rough set-theoretical measures in general Rough Set theory (RST) and measures of mutual consistency of multiple models of knowledge. In this research paper, the explicit dependence on the axiomatic theory of granules of [1] is reduced and more results on the measures and representat...
متن کاملCovering-based Granular Computing
In this lecture, binary granular computing (granular computing on binary relations) is re-examined. Two definitions for approximations in Rough Set Theory (one is from equivalence relation and the other from point-based topology view) were no longer equal under binary relation, the latter will have the better performance, especially when the universe is infinite. However, the point-based defini...
متن کاملApplication of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)
Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...
متن کاملRough Sets and Granular Computing in Geospatial Information
The representation of geographic entities is characterized by inherent granularity due to scale and resolution specific observations. This article discusses the various aspects of rough set-based approximation modeling of spatial and conceptual granularity. It outlines the context and applications of rough set theory in representing objects with intermediate boundaries, spatial reasoning and kn...
متن کاملDialectics of Counting and the Mathematics of Vagueness
New concepts of rough natural number systems are introduced in this research paper from both formal and less formal perspectives. These are used to improve most rough set-theoretical measures in general Rough Set theory (RST) and to represent rough semantics. The foundations of the theory also rely upon the axiomatic approach to granularity for all types of general RST recently developed by the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1212.6519 شماره
صفحات -
تاریخ انتشار 2012